On the Complexity of Two-Agent Justification Logic
نویسنده
چکیده
We investigate the complexity of derivability for two-agent Justification Logic. For this purpose we revisit Yavorskaya’s two-agent LP with interactions (2008), we simplify the syntax and provide natural extensions. We consider two-agent versions of other justification logics as well as ways to combine two justification logics. For most of these cases we prove that the upper complexity bound established for the single-agent cases are maintained: these logics’ derivability problem is in the second step of the polynomial hierarchy. For certain logics, though, we discover a complexity jump to PSPACE-completeness, which is a new phenomenon for Justification Logic.
منابع مشابه
Complexity Jumps In Multiagent Justification Logic Under Interacting Justifications
The Logic of Proofs, LP, and its successor, Justification Logic, is a refinement of the modal logic approach to epistemology in which proofs/justifications are taken into account. In 2000 Kuznets showed that satisfiability for LP is in the second level of the polynomial hierarchy, a result which has been successfully repeated for all other one-agent justification logics whose complexity is know...
متن کاملTR-2006005: Logical Omniscience via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of her assumptions. In this paper we suggest the following Logical Omniscience Test (LOT): an epistemic system E is not logically omniscient if for any valid in E knowledge assertion A of type ‘F is known’ there is a proof...
متن کاملLogical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of her assumptions. In this paper we suggest the following Logical Omniscience Test (LOT): an epistemic system E is not logically omniscient if for any valid in E knowledge assertion A of type ‘F is known’ there is a proof...
متن کاملNEXP-Completeness and Universal Hardness Results for Justification Logic
We provide a lower complexity bound for the satisfiability problem of a multi-agent justification logic, establishing that the general NEXP upper bound from our previous work is tight. We then use a simple modification of the corresponding reduction to prove that satisfiability for all multi-agent justification logics from there is Σ 2 -hard – given certain reasonable conditions. Our methods im...
متن کاملThe Complexity of Probabilistic Justification Logic
Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in polynomial space. We show that this upper complexity bound is tight.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014